| 翻訳と辞書 |
large sieve
In mathematics, the large sieve is a method (or family of methods and related ideas) in analytic number theory.
Its name comes from its original application: given a set such that the elements of ''S'' are forbidden to lie in a set ''Ap'' ⊂ Z/''p'' Z modulo every prime ''p'', how large can ''S'' be? Here ''Ap'' is thought of as being large, i.e., at least as large as a constant times ''p''; if this is not the case, we speak of a ''small sieve''. (The term "sieve" is seen as alluding to, say, sifting ore for gold: we "sift out" the integers falling in one of the forbidden congruence classes modulo ''p'', and ask ourselves how much is left at the end.)
== Development ==
Large-sieve methods have been developed enough that they are applicable to small-sieve situations as well. By now, something is seen as related to the large sieve not necessarily in terms of whether it related to the kind situation outlined above, but, rather, if it involves one of the two methods of proof traditionally used to yield a large-sieve result:
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「large sieve」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|